On the Canonical Version of a Theorem in Ramsey Theory
نویسنده
چکیده
We show that the constant colorings and the one-to-one colorings are insufficient for a canonical version of a certain theorem in Ramsey theory. Key phrases: van der Waerden’s theorem, arithmetic progression, piecewise syndetic, Ramsey Theory
منابع مشابه
The Canonical Ramsey Theorem and Computability Theory
Using the tools of computability theory and reverse mathematics, we study the complexity of two partition theorems, the Canonical Ramsey Theorem of Erdös and Rado, and the Regressive Function Theorem of Kanamori and McAloon. Our main aim is to analyze the complexity of the solutions to computable instances of these problems in terms of the Turing degrees and the arithmetical hierarchy. We succe...
متن کاملRamsey Theory on Trees and Applications
This result was motivated by and applied to solve a problem in logic regarding canonical k-ary relations on the natural numbers. Ramsey’s Theorem has been extended in a myriad of directions, for instance, varying sizes of sets colored, varying the number of colors allowed, including infinitely many colors, and coloring more complex structures. Progress in Ramsey theory has led to progress in a ...
متن کاملParametrizing by the Ellentuck space
We introduce a new construct that can be used to parametrize a topological Ramsey space by the collection of infinite subsets of natural numbers. We show that these parametrized spaces are topological Ramsey spaces. Then we prove a canonical Ramsey theorem for some of the parametrized spaces arising from the construction and conclude with some open questions concerning applications of these can...
متن کاملOn intermediate value theorem in ordered Banach spaces for noncompact and discontinuous mappings
In this paper, a vector version of the intermediate value theorem is established. The main theorem of this article can be considered as an improvement of the main results have been appeared in [textit{On fixed point theorems for monotone increasing vector valued mappings via scalarizing}, Positivity, 19 (2) (2015) 333-340] with containing the uniqueness, convergent of each iteration to the fixe...
متن کاملCanonical Ramsey numbers and properly colored cycles
We improve the previous bounds on the so-called unordered Canonical Ramsey numbers, introduced by Richer [D. Richer, Unordered canonical Ramsey numbers, Journal of Combinatorial Theory Series B 80 (2000) 172–177] as a variant of the canonical Ramsey numbers introduced by Erdős and Rado [P. Erdős, R. Rado, A combinatorial theorem, Journal of the London Mathematical Society 25 (4) (1950) 249–255]...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 12 شماره
صفحات -
تاریخ انتشار 2003